#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2005;

mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int n, m;
int a[N];

void solve() {
  cin >> n;
  rep(i, 1, n) cin >> a[i];
  int l = 1, r = 1, mx = 0;
  rep(i, 1, n) {
    int cnt = 0;  // maximize (lt - gt)
    rep(j, i + 1, n) {
      if (a[j] < a[i])
        cnt++;
      else if (a[j] > a[i])
        cnt--;
      if (cnt > mx) mx = cnt, l = i, r = j;
    }
  }
  cout << l << ' ' << r << endl;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}